A non-extendable abstract kernel
نویسندگان
چکیده
منابع مشابه
Non-extendable isomorphisms between affine varieties
In this paper, we report several large classes of affine varieties (over an arbitrary field K of characteristic 0) with the following property: each variety in these classes has an isomorphic copy such that the corresponding isomorphism cannot be extended to an automorphism of the ambient affine space Kn. This implies, in particular, that each of these varieties has at least two inequivalent em...
متن کاملA New Construction of Non-Extendable Intersecting Families of Sets
In 1975, Lovász conjectured that any maximal intersecting family of k-sets has at most b(e− 1)k!c blocks, where e is the base of the natural logarithm. This conjecture was disproved in 1996 by Frankl and his co-authors. In this short note, we reprove the result of Frankl et al. using a vastly simplified construction of maximal intersecting families with many blocks. This construction yields a m...
متن کاملA Secure Networked Laboratory for Kernel Programming ( Extended Abstract )
Recently, several flavors of Unix have appeared which run on inexpensive personal computers. Further, the source code for these operating systems is freely available. This makes offering courses that include realistic kernel programming feasible in an academic environment. However, root access is required in order to modify a system's kernel. This poses a potential security threat both to other...
متن کاملA Kernel Language for Algebraic Specification and Implementation - Extended Abstract
Abatrect A kernel specification language called ASL is presented. ASL comprises five fundamental but powerful specificationbuilding operations and has a simple semantics. Behavioural abstraction with respect to a set of observable sorts san be expressed, and (recurstve) parameterisad specifications can be defined using a more powerful and more expressive parameterisation mechanism than usual. A...
متن کاملSURFACE EMBEDDING OF NON-BIPARTITE k-EXTENDABLE GRAPHS
We find the minimum number k = μ(Σ) for any surface Σ, such that every Σ-embeddable non-bipartite graph is not k-extendable. In particular, we construct the so-called bow-tie graphs C6 ⊲⊳ Pn, and show that they are 3-extendable. This confirms the existence of an infinite number of 3-extendable non-bipartite graphs which can be embedded in the Klein bottle.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Illinois Journal of Mathematics
سال: 2003
ISSN: 0019-2082
DOI: 10.1215/ijm/1258488158